Guessing More Secrets via List Decoding
نویسندگان
چکیده
منابع مشابه
Guessing More Secrets via List Decoding
We consider the following game introduced by Chung, Graham, and Leighton in [Chung et al. 01]. One player, A, picks k > 1 secrets from a universe of N possible secrets, and another player, B, tries to gain as much information about this set as possible by asking binary questions f : [N ] −→ {0, 1}. Upon receiving a question f , A adversarially chooses one of her k secrets, and answers f accordi...
متن کاملGuessing human-chosen secrets
This dissertation is the result of my own work and includes nothing which is the outcome of work done in collaboration except where specifically indicated in the text. No parts of this dissertation have been submitted for any other qualification. This dissertation does not exceed the regulation length of 60, 000 words, including tables and footnotes. To Fletcher, for teaching me the value of ha...
متن کاملLecture 8 : More Results on List Decoding
Proof. Let C be a binary code with minimum relative distance δ. Suppose x ∈ {0, 1} is arbitrary and c1, c2, . . . , cL ∈ C are codewords such that for all i, ∆ (x, ci) < ρn. Since each ci is a codeword, we have that ∆ (ci, cj) ≥ δn for all i 6= j. Let Φ : {0, 1} → Rn be the map sending 0 to 1 and 1 to −1. Define u = Φ (x), and, for all i, define vi = Φ (ci). Let ū = 1 √ n u denote the normaliza...
متن کاملOptimal Rate List Decoding via Derivative Codes
The classical family of [n, k]q Reed-Solomon codes over a field Fq consist of the evaluations of polynomials f ∈ Fq[X ] of degree< k at n distinct field elements. In this work, we consider a closely related family of codes, called (orderm) derivative codes and defined over fields of large characteristic, which consist of the evaluations of f as well as its first m− 1 formal derivatives at n dis...
متن کاملA variant of the Guessing Secrets game
In [2], Chung et al. introduced the Guessing Secrets game. In [4] the authors introduce a variant of this game in which for each question the reference secret is chosen at random (with uniform distribution) by Responder. In this paper we investigate another variant in which Responder is required to answer truthfully to questions of the form How many secrets are there in X?, where X is a subset ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2005
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2005.10129099